MeNTT: A Compact and Efficient Processing-in-Memory Number Theoretic Transform (NTT) Accelerator

نویسندگان

چکیده

Lattice-based cryptography (LBC), exploiting learning with error (LWE) problems, is a promising candidate for postquantum cryptography. The number theoretic transform (NTT) the latency- and energy-dominant process in computation of LWE problems. This article presents compact efficient in-MEmory NTT accelerator, named MeNTT, which explores an optimized near 6T SRAM array. Specifically designed peripherals enable fast modular operations. Moreover, novel mapping strategy reduces data flow between stages into unique pattern, greatly simplifies routing among processing units (i.e., column this work), reducing energy area overheads. accelerator achieves significant latency reductions over prior arts.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Number Theoretic Hilbert Transform

Abstract This paper presents a general expression for a number-theoretic Hilbert transform (NHT). The transformations preserve the circulant nature of the discrete Hilbert transform (DHT) matrix together with alternating values in each row being zero and non-zero. Specific examples for 4point, 6-point, and 8-point NHT are provided. The NHT transformation can be used as a primitive to create cry...

متن کامل

Towards a Number Theoretic Discrete Hilbert Transform

This paper presents an approach for the development of a number theoretic discrete Hilbert transform. The forward transformation has been applied by taking the odd reciprocals that occur in the DHT matrix with respect to a power of 2. Specifically, the expression for a 16-point transform is provided and results of a few representative signals are provided. The inverse transform is the inverse o...

متن کامل

Some Historical Notes on Number Theoretic Transform

Modulo arithmetic modulo a prime integer have many interesting properties. Such properties are found in standard books on number theory. Some properties are especially of interest to the signal processing application. It was observed analogy exists between some of them and that cyclic convolution of two sequences modulo a prime integer of two sequences could be computed in integer domain as can...

متن کامل

Number Theoretic Transform -based Block Motion Estimation

A new fast full search algorithm for block motion estimation is presented, which is based on convolution theorem and number theoretic transforms. The algorithm applies the sum of squared differences (SSD) criterion, and the encoded video quality is equivalent or even better than what is achieved with conventional methods, but the algorithm has low theoretical complexity. The algorithm is implem...

متن کامل

Very fast discrete Fourier transform, using number theoretic transform

It is shown that number theoretic transforms (NTT) can be used to compute discrete Fourier transform (DFT) very efficiently. By noting some simple properties of number theory and the DFT, the total number of real multiplications for a length-P DFT is reduced to (P — 1). This requires less than one real multiplication per point. For a proper choice of transform length and NTT, the number of shif...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Very Large Scale Integration Systems

سال: 2022

ISSN: ['1063-8210', '1557-9999']

DOI: https://doi.org/10.1109/tvlsi.2022.3151321